Multi-agent oriented constraint satisfaction
نویسندگان
چکیده
منابع مشابه
Multi-agent oriented constraint satisfaction
This paper presents a multi-agent oriented method for solving CSPs (Constraint Satisfaction Problems). In this method, distributed agents represent variables and a two-dimensional grid-like environment in which the agents inhabit corresponds to the domains of the variables. Thus, the positions of the agents in such an environment constitute the solution to a CSP. In order to reach a solution st...
متن کاملMinutes from “Multi-agent Oriented Constraint Satisfaction”
The paper begins with a definition of a constraint satisfaction problem. Lin noted that we were all quite familiar with this definition, but discussing it helped to use up time in his presentation. The paper describes two general methods for solving a CSP: generate and test (GT), and backtracking search (BT). GT generates possible combinations of variables and checks whether it has found a solu...
متن کاملEscaping Local Optima in Multi-Agent Oriented Constraint Satisfaction
We present a multi-agent approach to constraint satisfaction where feedback and reinforcement are used in order to avoid local optima and, consequently, to improve the overall solution. Our approach, FeReRA, is based on the fact that an agent’s local best performance does not necessarily contribute to the system’s best performance. Thus, agents may be rewarded for improving the system’s perform...
متن کاملObject-Oriented Constraint Satisfaction
Constraint satisfaction problems are limited in that their domain values are treated as atomic entities. Object-Oriented Constraint Satisfaction Problems (OOCSPs) synthesize the object-oriented paradigm with declarative constraints to provide a rich language for describing domains. This paper introduces the concept of an OOCSP, describes algorithms for solving certain classes of OOCSPs, and giv...
متن کاملObject-Oriented Constraint Satisfaction
Constraint satisfaction problems are limited in that their domain values are treated as atomic entities, causing specifications for infinite CSPs to be solver-dependent. ObjectOriented Constraint Satisfaction Problems (OOCSPs) synthesize the object-oriented paradigm with declarative constraints to provide a rich language for describing infinite domains, independent of the solver. This paper int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2002
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(01)00174-6